public class NO21 {

public void reOrderArray(int [] a) {
????if(a==null||a.length==0)
????????return;
    int i=0;
    while(true){
      
        for(i = 0; i < a.length-1; i++){
           if ( isEven( a[i] ) && !isEven( a[i+1] ) ){
              EX(a);
               i=0;
               break;
           }
        }
        if(i==a.length-1)
            return;
       
        
    }
    
???
}
boolean isEven(int n){
????if(n%2==0) 
????????return true;
????return false;
}
    
    void EX(int[] a){
         int temp;
???	for(int k = 0;  k < a.length; k++){
       int  m = k +  1;
        if(m >=a.length)
            return ;
        if(isEven(a[ k]) && !isEven(a[m])){
            temp = a[m] ;
            a[m] =  a[k];
            a[k] = temp;
        }
    }
    }
}